Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
نویسندگان
چکیده
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-based constraint satisfaction problems (SCSPs), we define constraint hierarchy k-consistency (CH-k-C) and give a CH-2-C enforcement algorithm. We demonstrate how the CH-2-C algorithm can be seamlessly integrated into the ordinary branch-and-bound algorithm to make it a finite domain CH solver. Experimentation confirms the efficiency and robustness of our proposed solver prototype. Unlike other finite domain CH solvers, our proposed method works for both local and global comparators. In addition, our solver can support arbitrary error functions.
منابع مشابه
Finite Domain Bounds Consistency Revisited
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagation is performed by propagators implementing a certain notion of consistency. Bounds consistency is the method of choice for building propagators for arithmetic constraints and several global constraints in the finite ...
متن کاملConstraint Hierarchy and Stochastic Local Search for Solving Frequency Assignment Problem
One approach for modeling over-constrained problems is using constraint hierarchies. In the constraint hierarchy framework, constraints are grouped into levels, and appropriate solutions are selected using a comparator which takes into account the constraints and their levels. Finite domain Constraint Hierarchy is one of the NP-hard optimization problems that has been studied for a long time du...
متن کاملFull Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains
Consistency techniques proved to be an efficient method for reducing the search space of CSP. Several consistency techniques were proposed for soft constraint frameworks too. In this paper, we propose a full arc consistency (FAC) for weighted CSP (WCSP) and an algorithm for enforcing FAC and maintaining it during Branch & Bound search. We also define the transformation of constraint hierarchies...
متن کاملSolving Hierarchical Constraints over Finite Domains
Many real world problems have requirements and constraints which connict with each other and are not well deened. One framework for dealing with such over-constrained/fuzzy problems is provided by constraint hierarchies where constraints are divided into required and preferred with strengths and a comparator to select preferred solutions over others. In this paper, we examine techniques for sol...
متن کاملSolving Hierarchies of Finite-domain Constraints 1 2
In the past we presented an algorithm to solve ordered constraint hierarchies based on a non-trivial error function using standard constraint satisfaction techniques. We extended this previous work and herewith present a new method to transform hierarchies of inequalities over the integers based on global comparators into equivalent ordered constraint hierarchies. The correctness of this method...
متن کامل